Gradient projection and local region search for multiobjective optimisation

نویسنده

  • Jian-Bo Yang
چکیده

This paper presents a new method for multiobjective optimisation based on gradient projection and local region search. The gradient projection is conducted through the identi®cation of normal vectors of an ecient frontier. The projection of the gradient of a nonlinear utility function onto the tangent plane of the ecient frontier at a given ef®cient solution leads to the de®nition of a feasible local region in a neighbourhood of the solution. Within this local region, a better ecient solution may be sought. To implement such a gradient-based local region search scheme, a new auxiliary problem is developed. If the utility function is given explicitly, this search scheme results in an iterative optimisation algorithm capable of general nonseparable multiobjective optimisation. Otherwise, an interactive decision making algorithm is developed where the decision maker (DM) is expected to provide local preference information in order to determine trade-o€ directions and step sizes. Optimality conditions for the algorithms are established and the convergence of the algorithms is proven. A multiobjective linear programming (MOLP) problem is taken for example to demonstrate this method both graphically and analytically. A nonlinear multiobjective water quality management problem is ®nally examined to show the potential application of the method to real world decision problems. Ó 1999 Elsevier Science B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive directional local search strategy for hybrid evolutionary multiobjective optimization

A novel adaptive local search method is developed for hybrid evolutionary multiobjective algorithms (EMOA) to improve convergence to the Pareto front in multiobjective optimization. The concepts of local and global effectiveness of a local search operator are suggested for dynamic adjustment of adaptation parameters. Local effectiveness is measured by quantitative comparison of improvements in ...

متن کامل

Simulation-based optimisation using local search and neural network metamodels

This paper presents a new algorithm for enhancing the efficiency of simulation-based optimisation using local search and neural network metamodels. The local search strategy is based on steepest ascent Hill Climbing. In contrast to many other approaches that use a metamodel for simulation optimisation, this algorithm alternates between the metamodel and its underlying simulation model, rather t...

متن کامل

A comparative study on multiobjective metaheuristics for solving constrained in-core fuel management optimisation problems

In this paper, the topic of constrained multiobjective in-core fuel management optimisation (MICFMO) using metaheuristics is considered. Several modern and stateof-the-art metaheuristics from different classes, including evolutionary algorithms, local search algorithms, swarm intelligence algorithms, a probabilistic model-based algorithm and a harmony search algorithm, are compared in order to ...

متن کامل

Hyperheuristic Approaches for Multiobjective Optimisation

In multiobjective optimisation the aim is to find solutions that represent a compromise between the various (sometimes conflicting) criteria used to evaluate the quality of solutions. A solution x is said to be non-dominated with respect to a set of solutions S if there is no other solution in S that is, as good as x in all the criteria and better than x in at least one of the criteria. In Pare...

متن کامل

Analysis of Solution Quality of a Multiobjective Optimization-Based Evolutionary Algorithm for Knapsack Problem

Multi-objective optimisation is regarded as one of the most promising ways for dealing with constrained optimisation problems in evolutionary optimisation. This paper presents a theoretical investigation of a multi-objective optimisation evolutionary algorithm for solving the 0-1 knapsack problem. Two initialisation methods are considered in the algorithm: local search initialisation and greedy...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • European Journal of Operational Research

دوره 112  شماره 

صفحات  -

تاریخ انتشار 1999